A Fast, Storage-E cient Parallel Sorting Algorithm
نویسندگان
چکیده
A parallel sorting algorithm is presented for storage-e cient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparisonbased and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general-purpose MIMD machines, the Fujitsu AP1000 and the Thinking Machines CM5, is examined. The algorithm is suitable for implementation on special-purpose parallel machines, e.g. parallel database machines.
منابع مشابه
A Fast Algorithm for Making Su x Arrays and for Burrows-Wheeler Transformation
We propose a fast and memory e cient algorithm for sorting su xes of a text in lexicographic order. It is important to sort su xes because an array of indexes of su xes is called su x array and it is a memory e cient alternative of the su x tree. Sorting su xes is also used for the Burrows-Wheeler transformation in the Block Sorting text compression, therefore fast sorting algorithms are desire...
متن کاملA Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation
We propose a fast and memory e cient algorithm for sorting su xes of a text in lexicographic order. It is important to sort su xes because an array of indexes of su xes is called su x array and it is a memory e cient alternative of the su x tree. Sorting su xes is also used for the Burrows-Wheeler transformation in the Block Sorting text compression, therefore fast sorting algorithms are desire...
متن کاملConstructing Su x Arrays of Large Texts
Recently, Sadakane [12] proposes a new fast and memory e cient algorithm for sorting su xes of a text in lexicographic order. It is important to sort su xes because an array of indexes of su xes is called sufx array and it is a memory e cient alternative of the su x tree. Sorting su xes is also used for the Burrows-Wheeler transformation in the Block Sorting text compression, therefore fast sor...
متن کاملA Fast, Storage-eecient Parallel Sorting Algorithm
A parallel sorting algorithm is presented for storage-eecient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general...
متن کاملE cient Low Contention Parallel Algorithms
The queue read queue write qrqw parallel random access machine pram model permits concurrent reading and writing to shared memory locations but at a cost propor tional to the number of readers writers to any one memory location in a given step The qrqw pram model re#ects the contention properties of most commercially available par allel machines more accurately than either the well studied crcw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993